Profiling and reducing processing overheads in TCP/IP
نویسندگان
چکیده
منابع مشابه
Profiling and Reducing Processing Overheads in TCP/IP - Networking, IEEE/ACM Transactions on
This paper presents detailed measurements of processing overheads for the Ultrix 4.2a implementation of TCPLIP network software running on a DECstation 5000/200. The performance results were used to uncover throughput and latency bottlenecks. We present a scheme for improving throughput when sending large messages by avoiding most checksum computations in a relatively safe manner. We also show ...
متن کاملReducing Memory Sharing Overheads in Distributed JVMs
Distributed JVM systems by supporting Java’s shared-memory model enable concurrent Java applications to run transparently on clusters of computers. Aiming to reduce the overheads associated to memory coherence enforcement mechanisms required in such distributed JVMs, we propose two new techniques, selective dynamic diffing and lazy home allocation. To evaluate their potential benefits, both tec...
متن کاملReducing Address Translation Overheads with Virtual Caching
This dissertation research addresses overheads in supporting virtual memory, especially virtual-to-physical address translation overheads (i.e., performance, power, and energy) via a Translation Lookaside Buffer (TLB). To overcome the overheads, we revisit virtually indexed, virtually tagged caches. In practice, they have not been common in commercial microarchitecture designs, and the crux of ...
متن کاملReducing Scheduling Overheads for Concurrent Logic Programs
Strictness analysis is crucial for the efficient implementation of the lazy flmctionM languages. A related technique for the concurrent logic languages (CLLs) called schedule analysis is presented which divides at compile-time a CLL program into threads of totally ordered atoms, whose relative ordering is determined at run-time. The technique enables the enqueuing and dequeuing of processes to ...
متن کاملReducing Parallel Overheads Through Dynamic Serialization
If parallelism can be successfully exploited in a program, signi cant reductions in execution time can be achieved. However, if sections of the code are dominated by parallel overheads, the overall program performance can degrade. We propose a framework, based on an inspector-executor model, for identifying loops that are dominated by parallel overheads and dynamically serializing these loops. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 1996
ISSN: 1063-6692
DOI: 10.1109/90.556340